Approximations for Indivisible Concave Allocations with Applications to Nash Welfare Maximization

نویسندگان

چکیده

We study a general allocation setting where agent valuations are concave additive. In this model, collection of items must be uniquely distributed among set agents, each agent-item pair has specified utility. The objective is to maximize the sum valuations, which an arbitrary non-decreasing function agent's total additive This was studied by Devanur and Jain (STOC 2012) in online for divisible items. paper, we obtain both multiplicative approximations offline indivisible Our depend on novel parameters that measure local multiplicative/additive curvatures valuation, show correspond directly integrality gap natural assignment convex program problem. Furthermore, extend our guarantees constant Asymmetric Nash Welfare Maximization when agents have smooth valuations. algorithm also yields interesting tatonnement-style interpretation, adjust uniform prices assigned according maximum weighted bang-per-buck ratios.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities

Recently Cole and Gkatzelis [CG15] gave the first constant factor approximation algorithm for the problem of allocating indivisible items to agents, under additive valuations, so as to maximize the Nash social welfare (NSW). We give constant factor algorithms for a substantial generalization of their problem – to the case of separable, piecewise-linear concave utility functions. We give two suc...

متن کامل

APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items

We study the problem of allocating a set of indivisible items to agents with additive utilities to maximize the Nash social welfare. Cole and Gkatzelis [3] recently proved that this problem admits a constant factor approximation. We complement their result by showing that this problem is APX-hard.

متن کامل

Decentralizing lottery allocations in markets with indivisible commodities

In economies with indivisible commodities, consumers tend to prefer lotteries in commodities. A potential mechanism for satisying these preferences is unrestricted purchasing and selling of lotteries in decentralized markets, as suggested in Prescott and Townsend [-Int. Econ. Rev. 25, 1-20]. However, this paper shows in several examples that such lottery equilibria do not always exist for econo...

متن کامل

Welfare Maximization with Multiple Goods

When multiple goods are being auctioned off, it is often the case that each bidder values different subsets of goods differently. In general, we cannot completely describe the preferences of each bidder with a single scalar value, and so we move to a multi-parameter setting, where multiple numbers must be used to completely describe the type of each bidder. Auctions where multiple goods are bei...

متن کامل

On Worst-Case Allocations in the Presence of Indivisible Goods

We study a fair division problem, where a set of indivisible goods is to be allocated to a set of n agents. Each agent may have different preferences, represented by a valuation function that is a probability distribution on the set of goods. In the continuous case, where goods are infinitely divisible, it is well known that proportional allocations always exist, i.e., allocations where every a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i5.25708